A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
نویسندگان
چکیده
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. A Simple Paradigm for Graph Recognition : Application to Cographs and Distance Hereditary Graphs G. Damiand, Michel Habib, Christophe Paul
منابع مشابه
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes
A graph G is matching-decyclable if it has a matching M such that G−M is acyclic. Deciding whether G is matching-decyclable is an NPcomplete problem even if G is 2-connected, planar, and subcubic. In this work we present characterizations of matching-decyclability in the following classes: chordal graphs, split graphs, distance-hereditary graphs, cographs, and Hamiltonian subcubic graphs. All t...
متن کاملHamiltonian Cycle Problem on Distance-Hereditary Graphs
All graphs considered in this paper are finite and undirected, without loops or multiple edges. Let G = (V, E) be a graph. Throughout this paper, let m and n denote the numbers of edges and vertices of graph G, respectively. A connected graph is distance-hereditary if the distance between every two vertices in a connected induced subgraph is the same as that in the original graph. Distance-here...
متن کاملIndependent sets in edge-clique graphs
We show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in O(n4) time. We show that the independent set problem on edge-clique g...
متن کاملA Simple Linear Time LexBFS Cograph Recognition Algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for various families of graphs. In this paper, we add to this work by producing a simple two LexBFS sweep algorithm to recognize the family of cographs. This algorithm extends to other related graph families such as P4-red...
متن کاملEfficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs
A parallel algorithm to recognize cographs with a linear processor bound and a log’ II time bound is presented. This result extends the result of Adhar and Peng (1990). Moreover, we get a better time processor product than the algorithm of Lin and Olariu (199 I ). As a consequence distance hereditary graphs can be recognized by the same processor and time bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 263 شماره
صفحات -
تاریخ انتشار 2001